Deceptive Path-Planning
نویسندگان
چکیده
Deceptive path-planning involves finding a path such that the probability of an observer identifying its final destination—before it has been reached— is minimised. This paper formalises deception as it applies to path-planning and introduces the notion of a last deceptive point (LDP) which, when measured in terms of path completion, can be used to rank paths by their potential to deceive. Building on recent developments in probabilistic goalrecognition, we propose a formula to calculate an optimal LDP and present strategies for the generation of deceptive paths by both simulation (‘showing the false’) and dissimulation (‘hiding the real’).
منابع مشابه
Deceptive Routing in Relay Networks
Physical-layer and MAC-layer defense mechanisms against jamming attacks are often inherently reactive to experienced delay and loss of throughput after being attacked. In this paper, we study a proactive defense mechanism against jamming in multi-hop relay networks, in which one or more network sources introduce a deceptive network flow along a disjoint routing path. The deceptive mechanism lev...
متن کاملDeceptive robot motion: synthesis, analysis and experiments
Much robotics research explores how robots can clearly communicate true information. Here, we focus on the counterpart: communicating false information, or hiding information altogether – in one word, deception. Robot deception is useful in conveying intentionality, and in making games against the robot more engaging. We study robot deception in goal-directed motion, in which the robot is conce...
متن کاملPath achievement games
Starting with the empty graph on n vertices, two players alternately add edges until the graph contains a p-path. The last player to move wins. Assuming both players play optimally, the winner will depend only on p and n. We analyse the game for p ::; 6 and arbitrary n, determining the winner and providing a winning strategy. The results illustrate how deceptive computing the results of small c...
متن کامل3D Path Planning Algorithm for Mobile Anchor-Assisted Positioning in Wireless Sensor Networks
Positioning service is one of Wireless Sensor Networks’ (WSNs) fundamental services. The accurate position of the sensor nodes plays a vital role in many applications of WSNs. In this paper, a 3D positioning algorithm is being proposed, using mobile anchor node to assist sensor nodes in order to estimate their positions in a 3D geospatial environment. However, mobile anchor node’s 3D path optim...
متن کاملStudy of Evolutionary and Swarm Intelligent Techniques for Soccer Robot Path Planning
Finding an optimal path for a robot in a soccer field involves different parameters such as the positions of the robot, positions of the obstacles, etc. Due to simplicity and smoothness of Ferguson Spline, it has been employed for path planning between arbitrary points on the field in many research teams. In order to optimize the parameters of Ferguson Spline some evolutionary or intelligent al...
متن کامل